Subgradient method with feasible inexact projections for constrained convex optimization problems
نویسندگان
چکیده
منابع مشابه
Inexact subgradient methods for quasi-convex optimization problems
In this paper, we consider a generic inexact subgradient algorithm to solve a nondifferentiable quasi-convex constrained optimization problem. The inexactness stems from computation errors and noise, which come from practical considerations and applications. Assuming that the computational errors and noise are deterministic and bounded, we study the effect of the inexactness on the subgradient ...
متن کاملInexact subgradient methods over nonlinearly constrained networks
The minimization of nonlinearly constrained network flow problems can be performed by using approximate subgradient methods. The idea is to solve this kind of problem by means of primal-dual methods, given that the minimization of nonlinear network flow problems can be efficiently done by exploiting the network structure. In this work it is proposed to solve the dual problem by using 2subgradie...
متن کاملAn improved subgradient method for constrained nondifferentiable optimization
Polyak's subgradient method for constrained nondifferentiable optimization problems is modified in one respect to improve the computational efficiency. The two consecutive projection operations in Polyak method are combined into a single projection operation. The resulting algorithm has a convergence property which is strictly stronger than that of the original Polyak method. A computational te...
متن کاملInexact proximal stochastic gradient method for convex composite optimization
We study an inexact proximal stochastic gradient (IPSG) method for convex composite optimization, whose objective function is a summation of an average of a large number of smooth convex functions and a convex, but possibly nonsmooth, function. Variance reduction techniques are incorporated in the method to reduce the stochastic gradient variance. The main feature of this IPSG algorithm is to a...
متن کاملA Doubly Inexact Interior Proximal Bundle Method for Convex Optimization
We propose a version of bundle method for minimizing a non-smooth convex function. Our bundle method have three features. In bundle method, we approximate the objective with some cutting planes and minimize the model with some stabilizing term. Firstly, it allows inexactness in this minimization. At the same time, evaluations of the objective and the subgradient are also required to generate th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2021
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2021.1902520